Generalised Parsing: Some Costs
نویسندگان
چکیده
We discuss generalisations of bottom up parsing, emphasising the relative costs for real programming languages. Our goal is to provide a roadmap of the available approaches in terms of their space and time performance for programming language applications, focusing mainly on GLR style algorithms. It is well known that the original Tomita GLR algorithm fails to terminate on hidden left recursion: here we analyse two approaches to correct GLR parsing (i) the modification due to Farshi that is incorporated into Visser’s work and (ii) our own right-nullable GLR (RNGLR) algorithm, showing that Farshi’s approach can be expensive. We also present results from our new Binary RNGLR algorithm which is asymptotically the fastest parser in this family and show that the recently reported reduction incorporated parsers can require automata that are too large to be practical on current machines.
منابع مشابه
Generalised LR parsing algorithms
This thesis concerns the parsing of context-free grammars. A parser is a tool, defined for a specific grammar, that constructs a syntactic representation of an input string and determines if the string is grammatically correct or not. An algorithm that is capable of parsing any context-free grammar is called a generalised (contextfree) parser. This thesis is devoted to the theoretical analysis ...
متن کاملTitle: Practical Parsing of Generalised Phrase Structure Grammars
An efficient algorithm is described for parsing a dialect of generalised phrase structure grammar (GPSG). A practical parsing system, based on the algorithm, is presented. The dialect of GPSG which the parsing system accepts is smaller, but considerably "purer" (closer to the original definition of GPSG) and mathematically "cleaner" than that which is accepted by other practical parsing systems...
متن کاملPractical parsing of generalised phrase structure grammars
An efficient algorithm is described for parsing a dialect of generalised phrase structure grammar (GPSG). A practical parsing system, based on the algorithm, is presented. The dialect of GPSG which the parsing system accepts is smaller, but considerably "purer" (closer to the original definition of GPSG) and mathematically "cleaner" than that which is accepted by other practical parsing systems...
متن کاملGeneralized LR Parsing in Haskell
Parser combinators elegantly and concisely model generalised LL parsers in a purely functional language. They nicely illustrate the concepts of higherorder functions, polymorphic functions and lazy evaluation. Indeed, parser combinators are often presented as a motivating example for functional programming. Generalised LL, however, has an important drawback: it does not handle (direct nor indir...
متن کامل